A Matching Algorithm for Dynamic Ridesharing
نویسندگان
چکیده
منابع مشابه
Dynamic Matching for Real-Time Ridesharing
Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print ...
متن کاملLearning User Preferences in Matching for Ridesharing
Sharing car journeys can be very beneficial, since it can save travel costs, as well as reducing traffic congestion and pollution. The process of matching riders and drivers automatically at short notice, is referred to as dynamic ridesharing, which has attracted a lot of attention in recent years. In this paper, amongst the wide range of challenges in dynamic ridesharing, we consider the probl...
متن کاملDynamic Optimization Models for Ridesharing and Carsharing
Collaborative consumption is the culture of sharing instead of ownership in consumer behaviours. Transportation services such as ridesharing, carsharing, and bikesharing have recently adopted collaborative business models. Such services require real-time management of the available fleets to increase revenues and reduce costs. This thesis proposes two dynamic models for real-time management of ...
متن کاملImproved Algorithm for Dynamic b-Matching
Recently there has been extensive work on maintaining (approximate) maximum matchings in dynamic graphs. We consider a generalisation of this problem known as themaximum b-matching: Every node v has a positive integral capacity bv, and the goal is to maintain an (approximate) maximum-cardinality subset of edges that contains at most bv edges incident on every node v. The maximum matching proble...
متن کاملSharing Rides with Friends: A Coalition Formation Algorithm for Ridesharing
We consider the Social Ridesharing (SR) problem, where a set of commuters, connected through a social network, arrange one-time rides at short notice. In particular, we focus on the associated optimisation problem of forming cars to minimise the travel cost of the overall system modelling such problem as a graph constrained coalition formation (GCCF) problem, where the set of feasible coalition...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Procedia
سال: 2016
ISSN: 2352-1465
DOI: 10.1016/j.trpro.2016.12.087